Schultz and Modified Schultz Polynomials of Cog-Complete Bipartite Graphs
نویسندگان
چکیده
منابع مشابه
Extremal Modified Schultz Index of Bicyclic Graphs
For a graph G = (V,E), the modified Schultz index of G is defined as S∗(G) = ∑ {u,v}⊆V (G) (dG(u) · dG(v))dG(u, v) where dG(u) (or d(u)) is the degree of the vertex u of G, and dG(u, v) is the distance between u and v. Let B(n) be the set of bicyclic graph with n vertices. In this paper, we study the modified Schultz index of B(n), graphs in B(n) with the smallest modified Schultz index S∗(G) a...
متن کاملHosoya, Schultz, Modified Schultz Polynomials and Their Topological Indices of Benzene Molecules: First Members of Polycyclic Aromatic Hydrocarbons (PAHs)
A topological index is a real number related to the structure of a connected graph G and is invariant under graph automorphism. Let G be a (molecular) graph possessing n vertices and m edges, and e=x,y be an edge of G and x, y are two of its vertices, then the distance d(x,y)=d(x,y|G) between the vertices x and y is equal to the length of the shortest path that connects them in G. The goal of t...
متن کاملThe Modified Schultz Index of Trees
For a graph G = (V,E), the modified Schultz index of G is defined as S∗(G) = ∑ {u,v}⊂V (G) (dG(u) · dG(v))dG(u, v) where dG(u) (or d(u)) is the degree of the vertex u of G, and dG(u, v) is the distance between u and v. Lower bounds on modified Schultz index in trees in terms of the order and diameter are determined. Mathematics Subject Classification: 05C05, 05C12
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملArt.-Schultz (F)
Current theories view learning as the acquisition of specific predictions1–4. Humans and animals learn to predict the outcomes of their behavior, including rewards. Learning depends on the extent to which these outcomes are different than predicted, being governed by the discrepancy or ‘error’ between outcome and prediction. Outcomes that affect learning in this way are termed ‘reinforcers’. Le...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied and Computational Mathematics
سال: 2017
ISSN: 2328-5605
DOI: 10.11648/j.acm.20170606.14